HARMONIC CENTRALIZATION OF SOME GRAPH FAMILIES

Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, general formula for calculating graph-level centrality score based on node-level measure. The latter enables us to compare graphs extent which connections given network are concentrated single vertex or group vertices. One measures social analysis harmonic centrality. It sums inverse geodesic distances each node other where it 0 if there no path from one another, with sum normalized dividing $m-1$, $m$ number graph. In this paper, we present some results regarding centralization important families hope that formulas generated herein will be use when determines more complex graphs.